Global Approximation Of
نویسندگان
چکیده
We define a class of generic CR submanifolds of C n of real codi-mension d, 1 ≤ d ≤ n − 1, called the Bloom-Graham model graphs, whose graphing functions are partially decoupled in their dependence on the variables in the real directions. We prove a global version of the Baouendi-Treves CR approximation theorem, for Bloom-Graham model graphs with a polynomial growth assumption on their graphing functions.
منابع مشابه
SUPER- AND SUB-ADDITIVE ENVELOPES OF AGGREGATION FUNCTIONS: INTERPLAY BETWEEN LOCAL AND GLOBAL PROPERTIES, AND APPROXIMATION
Super- and sub-additive transformations of aggregation functions have been recently introduced by Greco, Mesiar, Rindone and v{S}ipeky [The superadditive and the subadditive transformations of integrals and aggregation functions, {it Fuzzy Sets and Systems} {bf 291} (2016), 40--53]. In this article we give a survey of the recent development regarding the existence of aggregation functions with ...
متن کاملGDOP Classification and Approximation by Implementation of Time Delay Neural Network Method for Low-Cost GPS Receivers
Geometric Dilution of Precision (GDOP) is a coefficient for constellations of Global Positioning System (GPS) satellites. These satellites are organized geometrically. Traditionally, GPS GDOP computation is based on the inversion matrix with complicated measurement equations. A new strategy for calculation of GPS GDOP is construction of time series problem; it employs machine learning and artif...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملModify the linear search formula in the BFGS method to achieve global convergence.
<span style="color: #333333; font-family: Calibri, sans-serif; font-size: 13.3333px; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: justify; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; background-color: #ffffff; text-dec...
متن کاملCoupling Nonlinear Element Free Galerkin and Linear Galerkin Finite Volume Solver for 2D Modeling of Local Plasticity in Structural Material
This paper introduces a computational strategy to collaboratively develop the Galerkin Finite Volume Method (GFVM) as one of the most straightforward and efficient explicit numerical methods to solve structural problems encountering material nonlinearity in a small limited area, while the remainder of the domain represents a linear elastic behavior. In this regard, the Element Free Galerkin met...
متن کاملOn the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators
In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...
متن کامل